Stability of re-entrant flow lines∗

نویسنده

  • Carlos F. Bispo
چکیده

The paper addresses the issue of stability for re-entrant flow lines, producing multiple products, with capacitated machines, random demand and random yield. The policies of interest are multi-echelon base stock policies, combined with a set of static and dynamic management rules of the available capacity. We introduce three classes of capacitated echelon base stock policies: Π0, the pure multi-echelon base stock; Π1, like Π0 with a possibly finite upper bound on the admission of raw materials; and Π2, like Π1 with a possibly finite upper bound on the utilization of intermediate inventories. The order of business is: establishing conditions for the stability of the shortfall echelon process when demands are stationary and ergodic; examining the regenerative structure of the shortfall process when demands are given by an i.i.d. sequence. The regenerative properties are valuable in establishing the convergence of costs and also simulation estimators, which enables the utilization of Infinitesimal Perturbation Analysis to optimize the policy parameters. We use a coupling argument for shortfalls while establishing the stability conditions, which will, by itself, render the Harris ergodicity of the shortfall process. We show that the stability condition suffices to ensure that the shortfall process possesses the regenerative structure of a Harris ergodic Markov chain. Under a stronger condition, we establish that the vector of shortfalls returns to the origin infinitely often, with probability one. We show that the necessary stability condition is also sufficient for any sort of re-entrant system, in the presence of random yield, provided the control policy is in Π2. Carlos F. Bispo Instituto Superior Tcnico, Av. Rovisco Pais, 1096-001 Lisboa, Portugal, e-mail: [email protected] ∗ This work was supported by the FCT Project PEst-OE/EEI/LA0009/2011.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

متن کامل

A Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II

In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Re-entrant Manufacturing Systems

Re-entrant manufacturing systems differ from traditional manufacturing systems in the sense that a job may visit a service station more than once, at various stages of the product development cycle. Several parts at different stages of processing may be in contention for service at the same machine, which gives rise to the need to solve scheduling problems. This document surveys some of the fac...

متن کامل

Stability of multi-class queueing networks with infinite virtual queues

We generalize the standard multi-class queueing network model by allowing both standard queues and infinite virtual queues which have infinite supply of work. We pose the general problem of finding policies which allow some of the nodes of the network to work with full utilization, and yet keep all the standard queues in the system stable. Towards this end we show that re-entrant lines, systems...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013